Does the application of time quantifiers, such as “sometimes” and “always” in loop invariants, increase the strength of the classical Naur-Floyd-Hoare induction assertion method for proving partial correctness of programs? This question is answered in the affirmative within the precise framework of nonstandard Dynamic Logic. It is also proved that the strengths of invariants with “sometimes” and with “always” are not comparable
We show a new approach in learning conjunctive invariants using dynamic testing of the program. Comi...
Verifiers that can prove programs correct against their full functional specification require, for p...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Does the application of time quantifiers, such as “sometimes” and “always” in loop invariants, incre...
We develop a set of laws for reasoning about real-time programs using assertions (preconditions and ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
The verification of programs offers great advantages for developers and users, because we can rely o...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
Abstract. Most of the properties established during program verification are either invariants or de...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
Fully automated verification of concurrent programs is a difficult problem, primarily because of sta...
AbstractVersions of Hoare logic have been introduced to prove partial and total correctness properti...
Non-regular program correctness properties play an important role in the specification of unbounded ...
We show a new approach in learning conjunctive invariants using dynamic testing of the program. Comi...
Verifiers that can prove programs correct against their full functional specification require, for p...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Does the application of time quantifiers, such as “sometimes” and “always” in loop invariants, incre...
We develop a set of laws for reasoning about real-time programs using assertions (preconditions and ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
The verification of programs offers great advantages for developers and users, because we can rely o...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
Abstract. Most of the properties established during program verification are either invariants or de...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
Fully automated verification of concurrent programs is a difficult problem, primarily because of sta...
AbstractVersions of Hoare logic have been introduced to prove partial and total correctness properti...
Non-regular program correctness properties play an important role in the specification of unbounded ...
We show a new approach in learning conjunctive invariants using dynamic testing of the program. Comi...
Verifiers that can prove programs correct against their full functional specification require, for p...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
DOI
Add to ORKG